OPTIMAL STRATEGY IN “GUESS WHO?”: BEYOND BINARY SEARCH
نویسندگان
چکیده
منابع مشابه
Optimal Strategy in "Guess Who?"
Guess Who?” is a popular two player game where players ask “Yes”/“No” questions to search for their opponent’s secret identity from a pool of possible candidates. This is modeled as a simple stochastic game. Using this model, the optimal strategy is explicitly found. Contrary to popular belief, performing a binary search is not always optimal. Instead, the optimal strategy for the player who tr...
متن کاملOptimal Binary Search Trees
An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum. For the purpose of a better presentation of optimal binary search trees, we will consider “extended binary search trees”, which have the keys stored at their internal nodes. Suppose “n” keys k1, k2, ... , k n are stored at the internal nodes of a binary search tre...
متن کاملNear-Optimal Compressive Binary Search
We propose a simple modification to the recently proposed compressive binary search [1]. The modification removes an unnecessary and suboptimal factor of log log n from the SNR requirement, making the procedure optimal (up to a small constant). Simulations show that the new procedure performs significantly better in practice as well. We also contrast this problem with the well known noisy binar...
متن کاملOn Optimal Binary Search Trees
We present a new linear time heuristic for constructing binary search trees. The analysis of the algorithm, by establishing an upper bound on the cost of the produced binary search trees, permits to derive a limitation on the cost of optimal binary search trees. The obtained upper bound improve on previous results.
متن کاملOptimal Search Engine Marketing Strategy
Buyers using search engines to look for information tend to trust and follow links displayed in the editorial section of the search-results page. Most on-line sellers, however, do not invest in search engine optimization (SEO) to get higher search-results rankings for their listings, but instead prefer paid placements. They explain that SEO is more expensive than paid placements, produces resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability in the Engineering and Informational Sciences
سال: 2016
ISSN: 0269-9648,1469-8951
DOI: 10.1017/s026996481600022x